Spanning trees in random regular uniform hypergraphs
نویسندگان
چکیده
منابع مشابه
Perfect Matchings in Random r-regular, s-uniform Hypergraphs
The copyright law of the United States (title 17, U.S. Code) governs the making of photocopies or other reproductions of copyrighted material. Any copying of this document without permission of its author may be prohibited by law. Perfect matchings in random i—regular, 5—uniform hypergraphs.
متن کاملOn the Number of Spanning Trees in Random Regular Graphs
Let d > 3 be a fixed integer. We give an asympotic formula for the expected number of spanning trees in a uniformly random d-regular graph with n vertices. (The asymptotics are as n → ∞, restricted to even n if d is odd.) We also obtain the asymptotic distribution of the number of spanning trees in a uniformly random cubic graph, and conjecture that the corresponding result holds for arbitrary ...
متن کاملRandom Minimum Length Spanning Trees in Regular Graphs
Consider a connected r-regular n-vertex graph G with random independent edge lengths, each uniformly distributed on (0,1). Let mst(G) be the expected length of a minimum spanning tree. We show that mst(G) can be estimated quite accurately under two distinct circumstances. Firstly, if r is large and G has a modest edge expansion property then mst(G) ∼ r ζ(3), where ζ(3) = ∑∞ j=1 j −3 ∼ 1.202. Se...
متن کاملRegular self-complementary uniform hypergraphs
A k-uniform hypergraph with vertex set V and edge set E is called t-subset-regular if every t-element subset of V lies in the same number of elements of E. In this paper we establish a necessary condition on n for there to exist a t-subset-regular selfcomplementary k-uniform hypergraph with n vertices. In addition, we show that this necessary condition is also sufficient in the case k = 3 and t...
متن کاملThe Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
A random walk on a finite graph can be used to construct a uniform random spanning tree. We show how random walk techniques can be applied to the study of several properties of the uniform random spanning tree: the proportion of leaves, the distribution of degrees, and the diameter.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2021
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548321000158